Optimal, output-sensitive algorithms for constructing planar hulls in parallel

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel

In this paper we focus on the problem of designing very fast parallel algorithms for the planar convex hull problem that achieve the optimal O(n log H) work-bound for input size n and output size H. Our algorithms are designed for the arbitrary CRCW PRAM model. We first describe a very simple ©(log n log H) time optimal deterministic algorithm for the planar hulls which is an improvement over t...

متن کامل

Robust algorithms for constructing strongly convex hulls in parallel

Given a set S of n points in the plane, an -strongly convex -hull of S is de0ned as a convex polygon P with the vertices taken from S such that no point of S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. This paper presents the 0rst parallel robust method for this generalized convex hull problem (note that the convex hull of ...

متن کامل

Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima

In this paper we focus on the problem of designing very fast parallel algorithms for the convex hull and the vector maxima problems in three dimensions that are output-size sensitive. Our algorithms achieve Oðlog log n log hÞ parallel time and optimal Oðn log hÞ work with high probability in the CRCW PRAM where n and h are the input and output size, respectively. These bounds are independent of...

متن کامل

Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel

The importance of the sensitivity of an algorithm to the output size of a problem is well known especially if the upper bound on the output size is known to be not too large. In this paper we focus on the problem of designing very fast parallel algorithms for constructing the upper envelope of straight-line segments that achieve the O(n logH) work-bound for input size n and output size H. When ...

متن کامل

Parallel Algorithms for Higher-Dimensional Convex Hulls

We give fast randomized and deterministic parallel methods for constructing convex hulls in IRd, for any fixed d. Our methods are for the weakest shared-memory model, the EREW PRAM, and have optimal work bounds (with high probability for the randomized methods). In particular, we show that the convex hull of n points in IRd can be constructed in O(logn) time using O(n logn + nbd=2c) work, with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 1997

ISSN: 0925-7721

DOI: 10.1016/s0925-7721(97)00009-6